Computing the Gromov hyperbolicity of a discrete metric space
نویسندگان
چکیده
منابع مشابه
Computing the Gromov hyperbolicity of a discrete metric space
We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using the (max,min) matrix product algorithm by Duan and Pettie, the fixed base-point hyperbolicity can be determined in O(n) time. It follows that the Gromo...
متن کاملGromov hyperbolicity and the Kobayashi metric
It is well known that the unit ball endowed with the Kobayashi metric is isometric to complex hyperbolic space and in particular is an example of a negatively curved Riemannian manifold. One would then suspect that when Ω ⊂Cd is a domain close to the unit ball then (Ω ,KΩ ) should be negatively curved (in some sense). Unfortunately, for general domains the Kobayashi metric is no longer Riemanni...
متن کاملDetours and Gromov hyperbolicity
The notion of Gromov hyperbolicity was introduced by Gromov in the setting of geometric group theory [G1], [G2], but has played an increasing role in analysis on general metric spaces [BHK], [BS], [BBo], [BBu], and extendability of Lipschitz mappings [L]. In this theory, it is often additionally assumed that the hyperbolic metric space is proper and geodesic (meaning that closed balls are compa...
متن کاملGromov Hyperbolicity in Mycielskian Graphs
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...
متن کاملComputing the Gromov-Hausdorff Distance for Metric Trees
The Gromov-Hausdorff distance is a natural way to measure distance between two metric spaces. We give the first proof of hardness and first non-trivial approximation algorithm for computing the Gromov-Hausdorff distance for geodesic metrics in trees. Specifically, we prove it is NP-hard to approximate the Gromov-Hausdorff distance better than a factor of 3. We complement this result by providin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2015
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2015.02.002